Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
نویسندگان
چکیده
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability properties. Though diagonal constraints do not add expressive power to classical TA, the standard forward analysis algorithm is not correct for this model. In this paper we survey several approaches to handle diagonal constraints and propose a refinement-based method for patching the usual algorithm: erroneous traces found by the classical algorithm are analyzed, and used for refining the model.
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملForward Analysis of Timed Automata
Timed automata constitute a well adapted model for real-time aspects. However, a classical forward analysis algorithm used to verify safety properties has been showed to be incorrect in the general framework of timed automata. Nevertheless, it is correct when we restrict the class to timed automata with only non-diagonal guards. The aim of this work is to understand the role of diagonal guards ...
متن کاملOn Conciseness of Extensions of Timed Automata
In this paper we study conciseness of various extensions of timed automata, and prove that several features like diagonal constraints or updates lead to exponentially more concise timed models.
متن کاملUpdatable timed automata
We investigate extensions of Alur and Dill’s timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting dec...
متن کاملSynchronized Recursive Timed Automata
We present synchronized recursive timed automata (SRTA) that extend timed automata with a stack. Each frame of a stack is composed of rational-valued clocks, and SRTA synchronously increase the values of all the clocks within the stack. Our main contribution is to show that the reachability problem of SRTA is ExpTime-complete. This decidability contrasts with the undecidability for recursive ti...
متن کامل